Tensor network method for reversible classical computation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tensor network method for reversible classical computation

We develop a tensor network technique that can solve universal reversible classical computational problems, formulated as vertex models on a square lattice [Nat. Commun. 8, 15303 (2017)]. By encoding the truth table of each vertex constraint in a tensor, the total number of solutions compatible with partial inputs/outputs at the boundary can be represented as the full contraction of a tensor ne...

متن کامل

Classical Reversible Computation with Zero Lyapunov Exponent

| In 1982, Edward Fredkin invented a way to build a time-reversible universal computer using fric-tionless \billiard balls" rolling on a table top, and in which ball \bounces" corresponded to Boolean logical operations. This model made it seem possible to perform unboundedly long computations while consuming zero power. But, achieving that feat seemed to require perfect precision and perfectly ...

متن کامل

Implementing Sets for Reversible Computation

Sets provide a very general tool for representing information and modelling the behaviour of systems. We consider their implementation and associated problems of garbage collection in the context of reversible computation. We describe our implementation technique, which uses ordered arrays, and discuss scalability of performance.

متن کامل

Classical and non-classical computation

supportive in the design process. For this to be possible, computation must be understood in a broad sense, encompassing both the narrow, digital kind of computation and the more general kind of computation in which objects may only have digital approximations. It is this broad approach that we have adopted. The aspects of computation considered here are representation and process. Representati...

متن کامل

2 Reversible Quantum Computation

It has long been known that to minimise the heat emitted by a determin-istic computer during it's operation it is necessary to make the computation act in a logically reversible manner[Lan61]. Such logically reversible operations require a number of auxiliary bits to be stored, maintaining a history of the computation, and which allows the initial state to be reconstructed by running the comput...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review E

سال: 2018

ISSN: 2470-0045,2470-0053

DOI: 10.1103/physreve.97.033303